Combining SNLP-like Planning and Dependency-Maintenance

نویسنده

  • Frank Weberskirch
چکیده

Real world planning tasks like manufacturing process planning often don't allow to formalize all of the relevant knowledge. Especially, preferences between alternatives are hard to acquire but have high innuence on the eeciency of the planning process and the quality of the solution. We describe the essential features of the CAPlan planning architecture that supports cooperative problem solving to narrow the gap caused by absent preference and control knowledge. The architecture combines an SNLP-like base planner with mechanisms for explict representation and maintenance of dependencies between planning decisions. The exible control interface of CAPlan allows a combination of autonomous and interactive planning in which a user can participate in the problem solving process. Especially, the rejection of arbitrary decisions by a user or dependency-directed backtracking mechanisms are supported by CAPlan.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Failure Driven Dynamic Search Control for Partial Order Planners: An Explanation Based Approach

Given the intractability of domain-independent planning, the ability to control the search of a planner is vitally important. One way of doing this involves learning from search failures. This paper describes SNLP+EBL, the first implementation of explanation based search control rule learning framework for a partial order (plan-space) planner. We will start by describing the basic learning fram...

متن کامل

A Comparison of the SNLP and TWEAK Planning Algorithms

Most current partial-order planning systems are based on either the TWEAK or SNLP planning algorithms. Both planning algorithms are complete and correct. The SNLP algorithm distinguishes itself from TWEAK in that it is also systematic, so it never generates redundant plans in its search space. This paper compares the two planning algorithms and shows that SNLP’S systematicity property does not ...

متن کامل

Decomposition and Causality in Partial-order Planning

We describe DPOCL, a partinl-order csnsal llnk planner that includes action decomposition. DPOCL builds directly on the SNLP algorithm (McAllester Rosenbiltt 1991), and hence is clear and simple, ud can readily be integrated with other SNLP extensions. In addition, DPOCL is specifically designed to handle partially specified action decompositions. Plan generation in DPOCL exploits the planner’s...

متن کامل

Extending Problem Speci cations for Plan-Space Planners

Problem speciications for classical planners based on a STRIPS-like representation typically consist of an initial situation and a partially deened goal state. Hierarchical planning approaches, e.g., Hierarchical Task Network (HTN) Planning, have not only richer representations for actions but also for the representation of planning problems. The latter are deened by giving an initial state and...

متن کامل

Learning Explanation-Based Search Control Rules for Partial Order Planning

This paper presents snlp+ebl, the first implementation of explanation based learning techniques for a partial order planner. We describe the basic learning framework of snlp+ebl, including regression, explanation propagation and rule generation. We then concentrate on snlp+ebl’s ability to learn from failures and present a novel approach that uses stronger domain and planner specific consistenc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995